Optimization of Fractal Image Compression Based on Genetic Algorithms
ثبت نشده
چکیده
The fractal image compression problem put forward three major requirements: speeding up the compression algorithm, improving image quality or increasing compression ratio. Major variants of the standard algorithm were proposed to speed up computation time. But most of them lead to a bad image quality, or a lower compression ratio. In this paper we present an implementation based on genetic algorithms. The main goal is to accelerate image compression without significant loss of image quality and with an acceptable compression rate. Results shown in section 3 prove that genetic compression is a good choice.
منابع مشابه
Intelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملOptimization of Fractal Image Compression Based on Genetic Algorithms
The main problem of all fractal compression implementations is the execution time. The algorithms can spend hours and hours to compress a single image. So the major variants of the standard algorithm were proposed to speed up computation time. But most of them lead to a bad quality, or a lower compression ratio. For example, the Fisher’s proposed classification pattern has greatly accelerated t...
متن کاملOptimization of fractal image compression with genetic algorithms
Fractal image compression explores the selfsimilarity property of a natural image and utilizes the partitioned iterated function system (PIFS) to encode it. The image compression method is time consuming in the encoding process. The time is essentially spent on the search of the similar domain block. In this paper, we present a method that uses Genetic algorithms to speed up computation time in...
متن کاملA Distributed Quantum Evolutionary Algorithm with a New Cycling Operator and Its Application in Fractal Image Compression
QUANTUM EVOLUTIONARY ALGORITHM (QEA) IS A NOVEL OPTIMIZATION ALGORITHM, PROPOSED FOR COMBINATORIAL PROBLEMS LIKE KNAPSACK AND TRAP PROBLEMS. WHILE FRACTAL IMAGE COMPRESSION IS IN THE CLASS OF NP-HARD PROBLEMS AND QEA IS HIGHLY SUITABLE FOR THE CLASS OF COMBINATORIAL PROBLEMS, QEA IS NOT WIDELY USED IN FRACTAL IMAGE COMPRESSION YET. IN ORDER TO IMPROVE THE PERFORMANCE OF FRACTAL IMAGE COMPRESSIO...
متن کاملFractal Image Compression Scheme Using Biogeography Based Optimization on Color Images
The main problem with fractal image compression is that it takes a lot of computational time for searching blocks (domain block and range block) and then compares these blocks. There are many optimization techniques which are used to improve efficiency of fractal image compression. Some of these are particle swarm optimization, ant colony optimization and biogeography based optimization. In thi...
متن کامل